Approaches to Multi-Agent Planning
نویسنده
چکیده
Multi-agent planning (MAP) is a major issue in the field of distributed AI. In the multi-agent environment, each agent must consider the constraints from other agents’ actions, when planning. It’s more complicated procedure than single agent planning. The research on Multi-agent planning attracts a lot of attention of researchers from different fields, including sociology, cognitive science, economics and so on. A lot of papers are published to discuss different issues in the multi-agent planning. In the term paper, we would make a general survey for them. Because some previous paper has been done for the same object, such as [3], [6] etc, we will attach much more attention on the recent work most of which are younger than 4 years. It’s hard to construct taxonomy to divide approaches to multi-agent planning, because the border between different approaches is not so clear that it’s impossible to put them in one category without any controversy. Our method may be not good enough to be agreed by everyone, but it will help us understand some issues in the multi-agent planning. The term paper is organized as follows: centralized planning techniques are firstly introduced. In the multi-agent environment, only one agent does the planning work, other agents cooperate to execute the plan. Secondly, distributed planning is discussed in detail, for it’s widely applied in the multi-agent environment, and more complicated. More agents take part in the planning. Then, from the views of system, we discuss centralized planning and decentralized planning, and the transformation between them. Finally, the continual planning is described, for its importance in the dynamic domains.
منابع مشابه
A Multi-Agent Extension of Hierarchical Task Network
Describing planning domains using a common formalism promotes greater reuse of research, allowing a fairer comparison between different approaches. Common planning formalisms for single-agent planning are already well established (e.g., PDDL, STRIPS, and HTN), but currently there is a shortage of multi-agent planning formalisms with clear semantics. In this paper, we propose a multi-agent exten...
متن کاملNumerical and Temporal Planning for a Multi-agent Team Acting in the Real World
Introduction. Automated planning is a central area of Artificial Intelligence which aims to design a powerful deliberation layer for autonomous intelligent systems. Autonomy of intelligent systems doesn’t concern only planning and deliberation but also acting. These two aspects are not completely disjoint: actors may deliberate or plan both before and during acting in order to perform intellige...
متن کاملScalable Greedy Algorithms for Task/Resource Constrained Multi-Agent Stochastic Planning
Synergistic interactions between task/resource allocation and stochastic planning exist in many environments such as transportation and logistics, UAV task assignment and disaster rescue. Existing research in exploiting these synergistic interactions between the two problems have either only considered domains where tasks/resources are completely independent of each other or have focussed on ap...
متن کاملOBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains
Recently model checking representation and search techniques were shown to be eeciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. obdds can eeectively ...
متن کاملStochastic Planning in Large Search Spaces
Multi-agent planning approaches are employed for many problems including task allocation, surveillance and video games. In the first part of my thesis, we study two multi-robot planning problems, i.e. patrolling and task allocation. For the patrolling problem, we present a novel stochastic search technique, Monte Carlo Tree Search with Useful Cycles, that can generate optimal cyclic patrol poli...
متن کامل